Serveur d'exploration sur la recherche en informatique en Lorraine - Exploration (Accueil)

Index « Keywords » - entrée « Computer theory »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
Computer tailoring < Computer theory < Computer tomography  Facettes :

List of bibliographic references indexed by Computer theory

Number of relevant bibliographic references: 106.
[0-50] [0 - 20][0 - 50][50-70]
Ident.Authors (with country if any)Title
001E88 (2012) A. Bellanger [France] ; A. Janiak [Pologne] ; M. Y. Kovalyov [Biélorussie] ; A. Oulamara [France]Scheduling an unbounded batching machine with job processing time compatibilities
002721 (2011) Mouhebeddine Berrima ; Narjes Ben Rajeb [Tunisie] ; Véronique Cortier [France]Deciding knowledge in security protocols under some e-voting theories
002802 (2011) Didier Galmiche [France] ; Yakoub Salhi [France]Sequent calculi and decidability for intuitionistic hybrid logic
002804 (2011) G. Bonfante [France] ; J.-Y. Marion [France] ; J.-Y. Moyen [France]Quasi-interpretations a way to control resources
002805 (2011) Isabelle Gnaedig [France] ; Hélène Kirchner [France]Proving weak properties of rewriting
002807 (2011) D. Jamet [France] ; G. Paquin [France] ; G. Richomme [France] ; L. Vuillon [France]On the fixed points of the iterated pseudopalindromic closure operator
002812 (2011) S. Chevillard [France] ; J. Harrison [États-Unis] ; M. Joldes [France] ; Ch. Lauter [France]Efficient and accurate computation of upper bounds of approximation errors
002815 (2011) Christopher Lynch [États-Unis] ; Silvio Ranise [Italie] ; Christophe Ringeissen [France] ; Duc-Khanh Tran [Namibie]Automatic decidability and combinability
002D68 (2010-04) Liliana Cucu-Grosjean [France] ; Joël Goossens [Belgique]Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems
003169 (2010) Yannick Chevalier [France] ; Michael Rusinowitch [France]Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures
003171 (2010) Guillaume Burel [France] ; Claude Kirchner [France]Regaining cut admissibility in deduction modulo using abstract completion
003180 (2010) Yannick Chevalier [France] ; Michaël Rusinowitch [France]Compiling and securing cryptographic protocols
003B75 (2009) Damien Jamet [France] ; Jean-Luc Toutant [France]Minimal arithmetic thickness connecting discrete planes
003B86 (2009) Mathieu Baudet [France] ; Véronique Cortier [France] ; Steve Kremer [France]Computationally sound implementations of equational theories against passive adversaries
004449 (2008) S. Brlek [Canada] ; D. Jamet [France] ; G. Paquin [Canada]Smooth words on 2-letter alphabets having same parity
004452 (2008) Elias P. Tsigaridas [France] ; Ioannis Z. Emiris [Grèce]On the complexity of real root isolation using continued fractions
004456 (2008) Jérome Besombes [France] ; Jean-Yves Marion [France]LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES
004460 (2008) Yannick Chevalier [France] ; Michael Rusinowitch [France]Hierarchical combination of intruder theories
004C23 (2007) Laurent Fousse [Niger]Multiple-Precision Correctly rounded Newton-Cotes quadrature
004D46 (2007) Dominique Barth [France] ; Johanne Cohen [France] ; Taoufik Faik [France]On the b-continuity property of graphs
004D50 (2007) Jérome Besombes [France] ; Jean-Yves Marion [France]Learning tree languages from positive examples and membership queries
004D51 (2007) Pierre Arnoux [France] ; Valérie Berthe [France] ; Thomas Fernique [France] ; Damien Jamet [France]Functional stepped surfaces, flips, and generalized substitutions
005416 (2006) Johanne Cohen [France] ; Fedor Fomin [Norvège] ; Pinar Heggernes [Norvège] ; Dieter Kratsch [France] ; Gregory Kucherov [France]Optimal Linear Arrangement of Interval Graphs
005483 (2006) Didier Galmiche [France] ; Dominique Larchey-Wendling [France]Expressivity Properties of Boolean BI Through Relational Models
005584 (2006) Combining logical systems
005589 (2006) Alexander Knapp [Allemagne] ; Stephan Merz [France] ; Martin Wirsing [Allemagne] ; Julia Zappe [Allemagne, France]Specification and refinement of mobile systems in MTLA and mobile UML
005595 (2006) Harald Ganzinger [Allemagne] ; Viorica Sofronie-Stokkermans [Allemagne] ; Uwe Waldmann [Allemagne]Modular proof systems for partial functions with Evans equality
005600 (2006) Olivier Bournez [France] ; Felipe Cucker [Hong Kong] ; Paulin Jacobe De Naurois [France] ; Jean-Yves Marion [France]Implicit complexity over an arbitrary structure : Quantifier alternations
005603 (2006) Abdessamad Imine [France] ; Michaël Rusinowitch [France] ; Gérald Oster [France] ; Pascal Molli [France]Formal design and verification of operational transformation algorithms for copies convergence
005604 (2006) Dominique Cansell [France] ; Dominique Méry [France]Formal and incremental construction of distributed algorithms : On the distributed reference counting algorithm
005607 (2006) Marco Bozzano [Italie] ; Roberto Bruttomesso [Italie] ; Alessandro Cimatti [Italie] ; Tommi Junttila [Finlande] ; Silvio Ranise [France] ; Peter Van Rossum [Pays-Bas] ; Roberto Sebastiani [Italie]Efficient theory combination via boolean search
005611 (2006) TING ZHANG [États-Unis] ; Henny B. Sipma [États-Unis] ; Zohar Manna [États-Unis]Decision procedures for term algebras with integer constraints
005612 (2006) Manin Abadi [États-Unis] ; Véronique Cortier [France]Deciding knowledge in security protocols under equational thoories
005616 (2006) Véronique Cortier [France] ; Steve Kremer [France] ; Ralf Kusters [Suisse] ; Bogdan Warinschi [France]Computationally sound symbolic secrecy in the presence of hash functions
005617 (2006) Michael Backes [Allemagne] ; Anupam Datta [États-Unis] ; Ante Derek [États-Unis] ; John C. Mitchell [États-Unis] ; Mathieu Turuani [France]Compositional analysis of contract-signing protocols
005621 (2006) JIA MENG [États-Unis] ; Claire Quigley [États-Unis] ; Lawrence C. Paulson [États-Unis]Automation for interactive proof : First prototype
005623 (2006) Nachum Dershowitz [Israël] ; Claude Kirchner [France]Abstract canonical presentations
005627 (2006) Franz Baader [Allemagne] ; Silvio Ghilardi [Italie] ; Cesare Tinelli [États-Unis]A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
006180 (2005) Clara Bertolissi [France]The Graph Rewriting Calculus: Confluence and Expressiveness
006181 (2005) Peter Bürgisser [Allemagne] ; Felipe Cucker [République populaire de Chine, Hong Kong] ; Paulin Jacobé De Naurois [France]The Complexity of Semilinear Problems in Succinct Representation
006289 (2005) Mathilde Bouvel [France] ; Vladimir Grebinski [États-Unis] ; Gregory Kucherov [France]Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey
006350 (2005) Hazel Everett [France] ; Celina M. H. De Figueiredo [Brésil] ; Sulamita Klein [Brésil] ; Bruce Reed [Canada]The perfection and recognition of bull-reducible Berge graphs
006361 (2005) Isabelle Debled-Rennesson [France] ; Jean-Luc Remy [France] ; Jocelyne Rouyer-Degli [France]Linear segmentation of discrete curves into blurred segments
006370 (2005) Olivier Bournez [France] ; Emmanuel Hainry [France]Elementarily computable functions over the real numbers and R-sub-recursive functions
006376 (2005) Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France]Closure properties and decision problems of dag automata
006379 (2005) Y. Gerard [France] ; I. Debled-Rennesson [France] ; P. Zimmermann [France]An elementary digital plane recognition algorithm
006380 (2005) Yannick Chevalier [France] ; Ralf Küsters [Allemagne] ; Michaël Rusinowitch [France] ; Mathieu Turuani [France]An NP decision procedure for protocol insecurity with XOR
006C83 (2004) Implicit computational complexity
006C87 (2004) René Schott [France] ; Jean-Claude Spehner [France]Two optimal parallel algorithms on the commutation class of a word
006C88 (2004) Laurent Alonso [France] ; Philippe Chassaing [France] ; Edward M. Reingold [États-Unis] ; René Schott [France]The worst-case chip problem
006C90 (2004) Patrick Baillot [France]Stratified coherence spaces: a denotational semantics for light linear logic

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/KwdEn.i -k "Computer theory" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/KwdEn.i  \
                -Sk "Computer theory" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    KwdEn.i
   |clé=    Computer theory
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022